A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions
نویسنده
چکیده
Consider the combinational complexity L(f) of Boolean functions over the basis fl={]'l]': {0, 1}2->{0, 1}}. A new method for proving linear lower bounds of size 2n is presented. we establish for a special sequence of functions [: {0, 1} "+2 g(n)+x-> {0, 1}: 2.5n <=L(f)<-6n. Also a trade-off result between circuit complexity and formula size is derived. 1. Introduction. The interest in lower bounds for the combinafonal complexity of Boolean functions stems from two facts: (i) practical interest: the hardware of a computer consists largely of switching networks; (ii) theory of algorithms: proving lower bounds for the run time of algorithms
منابع مشابه
Approximative Representation of Boolean Functions by Size Controllable Robdd's
ROBDD's((2]) are a very popular datastructure for the representation and manipulation of boolean functions. They have tractable sizes for many boolean functions and come up with eecient algorithms for boolean operations. In the worst case however, size and time complexity grows exponentially when performing a polynomial number of operations. However, there are applications where an approximate ...
متن کاملLower Bounds on the Area Complexity of Boolean Circuits
Hromkovif, J., S.A. Loikin, A.I. Rybko, A.A. Sapoienko and N.A. Skalikova, Lower bounds on the area complexity of Boolean circuits, Theoretical Computer Science 97 (1992) 2855300. The layout area of Boolean circuits is considered as a complexity measure of Boolean functions. Introducing the communication complexity of Boolean circuits and proving that this communication complexity squared provi...
متن کاملCircuit Complexity
Combinational circuits or shortly circuits are a model of the lowest level of computer hardware which is of interest from the point of view of computer science. Circuit complexity has a longer history than complexity theory. Complexity measures like circuit size and depth model sequential time, hardware cost, parallel time, and even storage space. This chapter contains an overview on the resear...
متن کاملLower Bounds on Communication Complexity ∗
A notion of ”communication complexity” is used to formally measure the degree to which a Boolean function is ”global”. An explicit combinatorial lower bound for this complexity measure is presented. In particular, this leads to an exp(Ω( √ n)) lower bound on the complexity of depth-restricted contact schemes computing some natural Boolean functions in NP.
متن کاملAn Explicit Lower Bound of 5n - o(n) for Boolean Circuits
We prove a lower bound of 5n − o(n) for the circuit complexity of an explicit (constructible in deterministic polynomial time) Boolean function , over the basis U2. That is, we obtain a lower bound of 5n−o(n) for the number of {and, or} gates needed to compute a certain Boolean function, over the basis {and, or, not} (where the not gates are not counted). Our proof is based on a new combinatori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 6 شماره
صفحات -
تاریخ انتشار 1977